Line - segment intersection made in - place ✩ Jan Vahrenhold
نویسنده
چکیده
We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban’s algorithm and, in the worst case, runs in O(n log2 n+ k) time using O(1) extra words of memory in addition to the space used for the input to the algorithm. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Space-efficient geometric divide-and-conquer algorithms
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form...
متن کاملOn the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm"
The output-sensitive “ultimate planar convex hull algorithm” of Kirkpatrick and Seidel [16] recently has been shown by Afshani et al. [1] to be instance-optimal. We revisit this algorithm with a focus on space-efficiency and prove that it can be implemented as an in-place algorithm, i.e., using O(1) working space.
متن کاملIn-Place Randomized Slope Selection
Slope selection, i.e. selecting the slope with rank k among all ( n 2 ) lines induced by a collection P of points, results in a widely used robust estimator for linefitting. In this paper, we demonstrate that it is possible to perform slope selection in expected O(n·log2 n) time using only constant extra space in addition to the space needed for representing the input.
متن کاملAn Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
متن کاملBichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time
We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007